Software ENgineering Verifying a Sliding Window Protocol in mCRL
نویسندگان
چکیده
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory. 2000 Mathematics Subject Classification: 68N30 [Specification and verification]; 68Q85 [Process algebras and
منابع مشابه
Verifying a Sliding Window Protocol in µCRL
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS.
متن کاملFDiBC: A Novel Fraud Detection Method in Bank Club based on Sliding Time and Scores Window
One of the recent strategies for increasing the customer’s loyalty in banking industry is the use of customers’ club system. In this system, customers receive scores on the basis of financial and club activities they are performing, and due to the achieved points, they get credits from the bank. In addition, by the advent of new technologies, fraud is growing in banking domain as well. Therefor...
متن کاملSpecification of a Communication Protocol in Graphical Interval Logic
We present a graphical interval logic for specifying and reasoning about computer systems and communication protocols, and demonstrate its use with a speciication of the sliding window protocol. Existing temporal logics have found little practical application because of the diiculty software engineers have in understanding and using them. Graphical interval logic has an intuitive graphical repr...
متن کاملAdaptive Segmentation with Optimal Window Length Scheme using Fractal Dimension and Wavelet Transform
In many signal processing applications, such as EEG analysis, the non-stationary signal is often required to be segmented into small epochs. This is accomplished by drawing the boundaries of signal at time instances where its statistical characteristics, such as amplitude and/or frequency, change. In the proposed method, the original signal is initially decomposed into signals with different fr...
متن کاملVerifying Cryptographic Protocols for Electronic Commerce
This paper describes the Convince toolset for detecting common errors in cryptographic protocols, protocols of the sort used in electronic commerce. We describe using Convince to analyze confidentiality, authentication, and key distribution in a recently developed protocol proposed for incorporation into a network bill-payment system, a public-key version of the Kerberos authentication protocol...
متن کامل